Hybrid Genetic Algorithm for Distributed Flow Shop Inverse Scheduling Problem
نویسندگان
چکیده
منابع مشابه
A multi-objective genetic algorithm (MOGA) for hybrid flow shop scheduling problem with assembly operation
Scheduling for a two-stage production system is one of the most common problems in production management. In this production system, a number of products are produced and each product is assembled from a set of parts. The parts are produced in the first stage that is a fabrication stage and then they are assembled in the second stage that usually is an assembly stage. In this article, the first...
متن کاملA Hybrid Genetic Algorithm for the Flow-Shop Scheduling Problem
This paper presents a hybrid genetic algorithm for the Job Shop Scheduling problem. The chromosome representation of the problem is based on random keys. The schedules are constructed using a priority rule in which the priorities are defined by the genetic algorithm. Schedules are constructed using a procedure that generates parameterized active schedules. After a schedule is obtained a local s...
متن کاملMILP Formulation and Genetic Algorithm for Non-permutation Flow Shop Scheduling Problem with Availability Constraints
In this paper, we consider a flow shop scheduling problem with availability constraints (FSSPAC) for the objective of minimizing the makespan. In such a problem, machines are not continuously available for processing jobs due to preventive maintenance activities. We proposed a mixed-integer linear programming (MILP) model for this problem which can generate non-permutation schedules. Furthermor...
متن کاملAn Effective Hybrid Genetic Algorithm for Job Shop Scheduling Problem
The job shop scheduling problem (JSSP) is well known as one of the most difficult combinatorial optimization problems. This paper presents a hybrid genetic algorithm for the JSSP with the objective of minimizing makespan. The efficiency of the genetic algorithm is enhanced by integrating it with a local search method. The chromosome representation of the problem is based on operations. Schedule...
متن کاملA hybrid genetic algorithm for the open shop scheduling problem
In this paper novel hybrid genetic algorithms for Open--Shop Scheduling Problem (OSSP) are presented. Two greedy heuristics LPT-Task and LPT-Machine are proposed for decoding chromosomes represented by permutations with repetitions. For comparison the standard permutation representation of OSSP instances is used. The algorithms apply also efficient crossover operator LOX and mutation operators ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Jixie gongcheng xuebao
سال: 2022
ISSN: ['0577-6686']
DOI: https://doi.org/10.3901/jme.2022.06.295